A NOTE ON DISCRETE MARKOVIAN DECISION PROCESS
نویسندگان
چکیده
منابع مشابه
Markovian assignment decision process
— A finite-state, discrete-time Markovian décision process, in which, each action in each state is a feasible solution to a state dependent assignment problème is considered, The objective is to maximize the additive rewards realized by the assignments over an infinité time horizon. In the undiscounted case, the average gain per transition and in the discounted case, the discounted total gain r...
متن کاملOn a Markovian Process AlgebraPeter
Process algebras extended by a concept to present timing behaviour have been very recently proposed as a good modelling tool for the combined analysis of qualitative and quantitative system behaviour. We introduce a a process algebra including exponentially distributed time delays and a systematic approach to compute the underlying labelled transition system and continuous time Markov process. ...
متن کاملA Partially Observable Markovian Maintenance Process with Continuous Cost Functions
In this paper a two-state Markovian maintenance process where the true state is unknown will be considered. The operating cost per period is a continuous random variable which depends on the state of the process. If investigation cost is incurred at the beginning of any period, the system wit I be returned to the "in-control" state instantaneously. This problem is solved using the average crite...
متن کاملA Note on Discrete Conduch
The class of functors known as discrete Conduch e brations forms a common generalization of discrete brations and discrete oppbrations, and shares many of the formal properties of these two classes. F. Lamarche 7] conjectured that, for any small category B, the category DCF=B of discrete Conduch e brations over B should be a topos. In this note we show that, although for suitable categories B t...
متن کاملA Note on Discrete Sets
We give several partial positive answers to a question of Juhász and Szentmiklóssy regarding the minimum number of discrete sets required to cover a compact space. We study the relationship between the size of discrete sets, free sequences and their closures with the cardinality of a Hausdorff space, improving known results in the literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Statistics
سال: 1964
ISSN: 0007-4993
DOI: 10.5109/13012